The k-assignment Polytope, Phylogenetic Trees, and Permutation Patterns
نویسنده
چکیده
In this thesis three combinatorial problems are studied in four papers. In Paper 1 we study the structure of the k-assignment polytope, whose vertices are the m× n (0,1)-matrices with exactly k 1:s and at most one 1 in each row and each column. This is a natural generalisation of the Birkhoff polytope and many of the known properties of the Birkhoff polytope are generalised. A representation of the faces by certain bipartite graphs is given. This representation is used to describe the properties of the polytope, such as a complete description of the cover relation in the face poset of the polytope and an exact expression for the diameter of its graph. An ear decomposition of these bipartite graphs is constructed. In Paper 2 we investigate the topology and combinatorics of a topological space, called the edge-product space, that is generated by a set of edge-weighted finite semi-labelled trees. This space arises by multiplying the weights of edges on paths in trees, and is closely connected to tree-indexed Markov processes in molecular evolutionary biology. In particular, by considering combinatorial properties of the Tuffley poset of semi-labelled forests, we show that the edgeproduct space has a regular cell decomposition with face poset equal to the Tuffley poset. The elements of the Tuffley poset are called X-forests, where X is a finite set of labels. A generating function of the X-forests with respect to natural statistics is studied in Paper 3 and a closed formula is found. In addition, a closed formula for the corresponding generating function of X-trees is found. Singularity analysis is used on these formulas to find asymptotics for the number of components, edges, and unlabelled nodes in X-forests and X-trees as |X| → ∞. In Paper 4 permutation statistics counting occurrences of patterns are studied. Their expected values on a product of t permutations chosen randomly from Γ ⊆ Sn, where Γ is a union of conjugacy classes, are considered. Hultman has described a method for computing such an expected value, denoted EΓ(s, t), of a statistic s, when Γ is a union of conjugacy classes of Sn. The only prerequisite is that the mean of s over the conjugacy classes is written as a linear combination of irreducible characters of Sn. Therefore, the main focus of this paper is to express the means of pattern-counting statistics as such linear combinations. A procedure for calculating such expressions for statistics counting occurrences of classical and vincular patterns of length 3 is developed, and is then used to calculate all these expressions.
منابع مشابه
New Facets of the QAP-Polytope
The Birkhoff polytope is defined to be the convex hull of permutation matrices, Pσ ∀σ ∈ Sn. We define a second-order permutation matrix P [2] σ in R ×n corresponding to a permutation σ as (P [2] σ )ij,kl = (Pσ)ij(Pσ)kl. We call the convex hull of the second-order permutation matrices, the second-order Birkhoff polytope and denote it by B. It can be seen that B is isomorphic to the QAP-polytope,...
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کاملAll 0-1 Polytopes are Traveling Salesman Polytopes
We study the facial structure of two important permutation polytopes in R n 2 , the Birkho or assignment polytope B n , de ned as the convex hull of all n n permutation matrices, and the asymmetric traveling salesman polytope T n , de ned as the convex hull of those n n permutation matrices corresponding to n-cycles. Using an isomorphism between the face lattice of B n and the lattice of elemen...
متن کاملOn the Shapley Value of Unrooted Phylogenetic Trees.
The Shapley value, a solution concept from cooperative game theory, has recently been considered for both unrooted and rooted phylogenetic trees. Here, we focus on the Shapley value of unrooted trees and first revisit the so-called split counts of a phylogenetic tree and the Shapley transformation matrix that allows for the calculation of the Shapley value from the edge lengths of a tree. We sh...
متن کامل